#include <bits/stdc++.h>
using namespace std;

const int maxn = 1e5 + 3;

int n, x[2][maxn], ans = -0x3fffffff;
set<int> cs;
vector<int>a;

int check() { 

}

void dfs(int now) { 
    if (now == n + 1) { 
        ans = max(ans, check());
        return;
    }
    dfs(now)
}
int main() { 
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) { 
        scanf("%d%d", &x[0][i], &x[1][i]);
    }
}
